Decomposing 8-regular graphs into paths of length 4
نویسندگان
چکیده
منابع مشابه
Decomposing 8-regular graphs into paths of length 4
A T -decomposition of a graph G is a set of edge-disjoint copies of T in G that cover the edge set of G. Graham and Häggkvist (1989) conjectured that any 2l-regular graph G admits a T -decomposition if T is a tree with l edges. Kouider and Lonc (1999) conjectured that, in the special case where T is the path with l edges, G admits a T -decomposition D where every vertex of G is the end-vertex o...
متن کاملDecomposing Highly Connected Graphs into Paths of Length Five
Barát and Thomassen (2006) posed the following decomposition conjecture: for each tree T , there exists a natural number kT such that, if G is a kT -edge-connected graph and |E(G)| is divisible by |E(T )|, then G admits a decomposition into copies of T . In a series of papers, Thomassen verified this conjecture for stars, some bistars, paths of length 3, and paths whose length is a power of 2. ...
متن کاملDecomposing Graphs into Long Paths
It is known that the edge set of a 2-edge-connected 3-regular graph can be decomposed into paths of length 3. W. Li asked whether the edge set of every 2-edge-connected graph can be decomposed into paths of length at least 3. The graphs C3, C4, C5, and K4 − e have no such decompositions. We construct an infinite sequence {Fi}∞i=0 of nondecomposable graphs. On the other hand, we prove that every...
متن کاملDecomposing 4-Regular Graphs into Triangle-Free 2-Factors
There is a polynomial algorithm which finds a decomposition of any given 4-regular graph into two triangle-free 2-factors or shows that such a decomposition does not exist.
متن کاملDecomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two
A P3-decomposition of a graph is a partition of the edges of the graph into paths of length two. We give a necessary and sufficient condition for a semi-complete multigraph, that is a multigraph with at least one edge between each pair of vertices, to have a P3-decomposition. We show that this condition can be tested in strongly polynomial-time, and that the same condition applies to a larger c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.04.024